Adaptive data structures for IP lookups
نویسندگان
چکیده
منابع مشابه
Algorithms and Data Structures for Ip Lookups
Ioannidis, Ioannis. Ph.D., Purdue University, May, 2005. Algorithms and DataStructures for IP Lookups. Major Professor: Ananth Grama. The problem of optimizing access mechanisms for IP routing tables is an impor-tant and well studied one. Several techniques have been proposed for structuringand managing routing tables, with special emphasis on backbone, high-throughputrouting. T...
متن کاملOverview of Data Structures in IP Lookups
This report sums up various available methods to find the best matching prefix (BMP) of a string especially for the purpose of IP address lookup in routers. The router decides what to do with an incoming packet according to the longest matching prefix in its routing table. This report does not contain any original methods nor results, it is intended purely as an overview. The method to be used ...
متن کاملEfficient Caching for IP Lookups
IP address lookups form a critical component of the internet routing infrastructure. Typically based on trie-based structures and related extensions, the problem has several similarities to other applications of dictionaries in data compression, information retrieval, etc. The extreme need for speed in IP lookups has prompted considerable research in development of appropriate data structures, ...
متن کاملIP Routing Lookups Algorithms Evaluation
We consider the problem of organizing the Internet routing tables in such a way as to enable fast routing lookup performance We concentrate on two recently proposed methods and try to evaluate their performance We describe our implementation of the methods and results of performance measurements on existing as well as arti cially generated input data We present some conclusions about the genera...
متن کاملCache Replacement Policies for Ip Address Lookups
In IP routing, the routing table lookup is a very important operation and the speed in which it is performed determines the overall performance of Internet processors. Consequently, caching schemes are implemented in such processors to speed up these operations. A well-known factor affecting the performance of caches is the replacement policy, which decides which entry in the cache to be replac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Journal of Experimental Algorithmics
سال: 2005
ISSN: 1084-6654,1084-6654
DOI: 10.1145/1064546.1064548